Pattern matching in $(213, 231)$-avoiding permutations
نویسندگان
چکیده
Given permutations σ ∈ Sk and π ∈ Sn with k < n, the pattern matching problem is to decide whether π matches σ as an orderisomorphic subsequence. We give a linear-time algorithm in case both π and σ avoid the two size-3 permutations 213 and 231. For the special case where only σ avoids 213 and 231, we present aO(max(kn, n log(log(n))) time algorithm. We extend our research to bivincular patterns that avoid 213 and 231 and present a O(kn) time algorithm. Finally we look at the related problem of the longest subsequence which avoids 213 and 231.
منابع مشابه
The equidistribution of some vincular patterns on 132-avoiding permutations
A pattern in a permutation π is a sub-permutation of π, and this paper deals mainly with length three patterns. In 2012 Bóna showed the rather surprising fact that the cumulative number of occurrences of the patterns 231 and 213 are the same on the set of permutations avoiding 132, even though the pattern based statistics 231 and 213 do not have the same distribution on this set. Here we show t...
متن کاملThe equidistribution of some length three vincular patterns on $S_n(132)$
In 2012 Bóna showed the rather surprising fact that the cumulative number of occurrences of the classical patterns 231 and 213 are the same on the set of permutations avoiding 132, beside the pattern based statistics 231 and 213 do not have the same distribution on this set. Here we show that if it is required for the symbols playing the role of 1 and 3 in the occurrences of 231 and 213 to be a...
متن کاملHardness of Permutation Pattern Matching
Permutation Pattern Matching (or PPM) is a decision problem whose input is a pair of permutations π and τ , represented as sequences of integers, and the task is to determine whether τ contains a subsequence order-isomorphic to π. Bose, Buss and Lubiw proved that PPM is NP-complete on general inputs. We show that PPM is NP-complete even when π has no decreasing subsequence of length 3 and τ has...
متن کاملUnshuffling Permutations
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the problem of recognizing square permutations from both the point of view of algebra and algorithms. On the one hand, we present some algebraic and combinatorial p...
متن کاملPattern avoidance and RSK-like algorithms for alternating permutations and Young tableaux
We define a class Ln,k of permutations that generalizes alternating (up-down) permutations. We then give bijective proofs of certain pattern-avoidance results for this class. The bijections employed include are a modified form of the RSK insertion algorithm and a different bijection with RSK-like properties. As a special case of our results, we give two bijections between the set A2n(1234) of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1511.01770 شماره
صفحات -
تاریخ انتشار 2015